Breaking Conditional Symmetry in Automated Constraint Modelling with CONJURE
نویسندگان
چکیده
Many constraint problems contain symmetry, which can lead to redundant search. If a partial assignment is shown to be invalid, we are wasting time if we ever consider a symmetric equivalent of it. A particularly important class of symmetries are those introduced by the constraint modelling process: model symmetries. We present a systematic method by which the automated constraint modelling tool CONJURE can break conditional symmetry as it enters a model during refinement. Our method extends, and is compatible with, our previous work on automated symmetry breaking in CONJURE. The result is the automatic and complete removal of model symmetries for the entire problem class represented by the input specification. This applies to arbitrarily nested conditional symmetries and represents a significant step forward for automated constraint modelling.
منابع مشابه
Automated Symmetry Breaking and Model Selection in Conjure
Constraint modelling is widely recognised as a key bottleneck in applying constraint solving to a problem of interest. The CONJURE automated constraint modelling system addresses this problem by automatically refining constraint models from problem specifications written in the ESSENCE language. ESSENCE provides familiar mathematical concepts like sets, functions and relations nested to any dep...
متن کاملAn Automated Constraint Modelling and Solving Toolchain
Constraint Programming (CP) is a powerful technique for solving a wide range of combinatorial problems. However, non-experts have difficulty in formulating the good constraint models of problems necessary for a constraint solver to obtain solutions effectively. Hence, it is desirable to automate constraint modelling. Our approach, embodied in our CONJURE system, is to refine constraint models f...
متن کاملConditional Symmetry Breaking
We introduce the study of Conditional symmetry breaking in constraint programming. This arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Conditional symmetry can cause redundancy in a systematic search for solutions. Breaking this symmetry is an important part of solving a constraint satisfaction ...
متن کاملConjure Revisited: Towards Automated Constraint Modelling
Automating the constraint modelling process is one of the key challenges facing the constraints field, and one of the principal obstacles preventing widespread adoption of constraint solving. This paper focuses on the refinement-based approach to automated modelling, where a user specifies a problem in an abstract constraint specification language and it is then automatically refined into a con...
متن کاملExtensible Automated Constraint Modelling
In constraint solving, a critical bottleneck is the formulation of an effective constraint model of a given problem. The CONJURE system described in this paper, a substantial step forward over prototype versions of CONJURE previously reported, makes a valuable contribution to the automation of constraint modelling by automatically producing constraint models from their specifications in the abs...
متن کامل